منابع مشابه
On Generalizations of Separating and Splitting Families
Starting from the well-established notion of a separating family (or separating system) and the refinement known as a splitting family, we define and study generalizations called n-separating and n-splitting families, obtaining lower and upper bounds on their minimum sizes. For n-separating families our bounds are asymptotically tight within a linear factor, while for n-splitting families we pr...
متن کاملOn optimal bounds for separating hash families
This paper concerns optimal bounds and constructions for separating hash families of type {1, w} and {2, 2}. We first prove optimal bounds for separating hash families of type {1, w} and show constructions of families achieving the bounds. As a by-product of the results we obtain a positive answer to a question put by Blackburn, Etzion, Stinson and Zaverucha recently. Next we study optimal boun...
متن کاملOn judicious bipartitions of graphs
For a positive integer m, let f(m) be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and let g(m) be the minimum value s such that for any graph G with m edges there exists a bipartition V (G) = V1 ∪ V2 such that G has at most s edges with both incident vertices in Vi. Alon proved that the limsup of f(m)− (m/2 + √ m/8) tends to infinity as m te...
متن کاملA bound on the size of separating hash families
The paper provides an upper bound on the size of a (generalized) separating hash family, a notion introduced by Stinson, Wei and Chen. The upper bound generalizes and unifies several previously known bounds which apply in special cases, namely bounds on perfect hash families, frameproof codes, secure frameproof codes and separating hash families of small type. © 2008 Elsevier Inc. All rights re...
متن کاملA note on balanced bipartitions
A balanced bipartition of a graph G is a bipartition V1 and V2 of V (G) such that −1 ≤ |V1| − |V2| ≤ 1. Bollobás and Scott conjectured that if G is a graph with m edges and minimum degree at least 2 then G admits a balanced bipartition V1, V2 such that max{e(V1), e(V2)} ≤ m/3, where e(Vi) denotes the number of edges of G with both ends in Vi. In this note, we prove this conjecture for graphs wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.10.015